Efficient Multiple Pass, Multiple Output Algorithms on the Gpu
نویسنده
چکیده
This paper presents an evaluation of the state of the art in Graphics Processing Unit (GPU) algorithmic techniques. Fast, portable methods for maintaining state between independent passes of an algorithm are compared and contrasted with similar techniques from the previous generation, which are still in widespread use in the graphical and non-graphical fields today. The performance of these features in isolation and in unison with real algorithms is measured and contrasted with that of existing techniques. A revised set of constraints on the GPU programming model is presented in light of these findings.
منابع مشابه
Implementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)
Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...
متن کاملEfficient Stream Reduction on the GPU
Stream reduction is the process of removing unwanted elements from a stream of outputs. It is a key component of many GPGPU algorithms, especially in multi-pass algorithms: the stream reduction is used to remove unwanted elements from the output of a previous pass before sending it as input for the next pass. In this paper, we present a new efficient algorithm for stream reduction on the GPU. O...
متن کاملSingle-Pass Point Rendering and Transparent Shading
Hardware accelerated point-based rendering (PBR) algorithms have suffered in the past from multiple rendering passes; possibly a performance limiting factor. Two passes over the point geometry have been necessary because a first visibility-splatting pass has been necessary for conservative ε-z-buffer visibility culling in the following point-interpolation rendering pass. This separation into vi...
متن کاملSolving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملImplementation of a High Throughput Soft MIMO Detector on GPU
Multiple-input multiple-output (MIMO) significantly increases the throughput of a communication system by employing multiple antennas at the transmitter and the receiver. To extract maximum performance from a MIMO system, a computationally intensive search based detector is needed. To meet the challenge of MIMO detection, typical suboptimal MIMO detectors are ASIC or FPGA designs. We aim to sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005